Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
نویسندگان
چکیده
We provide polynomial-time algorithms for counting the number of perfect matchings and the number of matchings in chain graphs, cochain graphs, and threshold graphs. These algorithms are based on newly developed subdivision schemes that we call a recursive decomposition. On the other hand, we show the #P-completeness for counting the number of perfect matchings in chordal graphs, split graphs and chordal bipartite graphs. This is in an interesting contrast with the fact that counting the number of independent sets in chordal graphs can be done in linear time.
منابع مشابه
Dominating Set Counting in Graph Classes
We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the ti...
متن کاملConnected matchings in chordal bipartite graphs
A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملThe Dilworth Number of Auto-Chordal-Bipartite Graphs
The mirror (or bipartite complement) mir(B) of a bipartite graph B = (X,Y,E) has the same color classes X and Y as B, and two vertices x ∈ X and y ∈ Y are adjacent in mir(B) if and only if xy / ∈ E. A bipartite graph is chordal bipartite if none of its induced subgraphs is a chordless cycle with at least six vertices. In this paper, we deal with chordal bipartite graphs whose mirror is chordal ...
متن کاملMaximum induced matching problem on hhd-free graphs
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...
متن کامل